// TangQiao
#include "stdio.h"
#include "string.h"

int shu[500],tt[500],mul2[500],mul3[500];
int an[500];
char s[500];

void delblank()
{
    int i,j,len,flag;
    len=strlen(s);
    memset(shu,0,sizeof(shu));
  
    
    for (i=1;i<=30;i++)
        shu[0]++;       

    for (i=len-1;i>=0;i--)
    {
        j=s[i]-'0';
        if (j>=0&&j<=9)
        {
            shu[0]++;
            shu[shu[0]]=j;
        }    
    }   
    while (shu[shu[0]]==0) shu[0]--;
      
}    

void mul(int *t1,int *t2,int *to)
{
    int i,j,site,len1,len2,len,from1,from2;

    len1=t1[0];
    len2=t2[0];
    len=len1+len2;
    memset(to,0,sizeof(to));
    from1=1;
    while (t1[from1]==0) from1++;
    from2=1;
    while (t2[from2]==0) from2++;    
    
    for (i=from1;i<=len1;i++)
    	for (j=from2;j<=len2;j++)
    	{
    	    site=i+j-1;
    	    to[site]+=t1[i]*t2[j];
    	    if (to[site]>9) 
    	    {
         	    to[site+1]+=to[site]/10;
         	    to[site]%=10;
    	    }    
    	}    
   	while (to[len]==0&&len>1) len--;
    to[0]=len;
    
}    

int da(int *t1,int *t2)
{
    int len1,len2,i;
    len1=t1[0];
    len2=t2[0];
    if (len1<len2) return 0;
    if (len1>len2) return 1;
    for (i=len1;i>=1;i--)
    {
        if (t1[i]!=t2[i])
        {
            if (t1[i]<t2[i]) return 0;
            else return 1; 
        }    
    }    
    return 2;
}    



void count()
{
	int i,j,flag=0; 
	
    memset(an,0,sizeof(an));
    an[0]=(shu[0]-1)/3+1;
    for (i=an[0];i>=1;i--)
    {
        for (j=1;j<=9;j++)
        {
            an[i]=j;
            memset(mul2,0,sizeof(mul2));
            memset(mul3,0,sizeof(mul3));
            mul(an,an,mul2);
            mul(an,mul2,mul3);
            if (da(mul3,shu)==1)
            {
                an[i]--;
                break;
            }    
            else if (da(mul3,shu)==2)
            {
                flag=1;
                break;
            }
        }   
        if (flag) break; 
    }    
 
}    

main()
{
    int i,j,sum,locate;
    while (scanf("%s",s)!=EOF)
    {
        delblank();
        count();
       
        sum=0;
        for (i=1;i<=an[0];i++) sum+=an[i];
        sum%=10;
        printf("%d ",sum);
        for (i=an[0];i>=1;i--) 
        {
            if (i==10) printf(".");
            printf("%d",an[i]);
        }   
        printf("\n");       
    }        
}    
/*
	problem name: Cube Root
	&cedil;&szlig;&frac34;&laquo;&para;&Egrave;&Euml;&atilde;·¨ 
	&Iuml;à&sup3;&Euml;&Ecirc;±&Oacute;&Aring;&raquo;&macr;&pound;&not;°&Ntilde;×&icirc;&ordm;ó&micro;&Auml;&Aacute;&atilde;&Icirc;&raquo;&frac14;&Ccedil;&Iuml;&Acirc;&Agrave;&acute;&pound;&not;&Ouml;&raquo;&Ecirc;&Ccedil;&acute;&Oacute;·&Ccedil;&Aacute;&atilde;&Icirc;&raquo;&iquest;&ordf;&Ecirc;&frac14;&sup3;&Euml;&iexcl;&pound;
 	&Iuml;à&sup1;&Oslash;&acute;ú&Acirc;&euml;&pound;&ordm; 
 	from1=1;
    while (t1[from1]==0) from1++;
    from2=1;
    while (t2[from2]==0) from2++;   
    
    discover:
        &Ocirc;&Uacute;°&Ntilde;&Ecirc;&yacute;×é&acute;&laquo;&cedil;&oslash;&Auml;&atilde;&Ograve;&raquo;&ordm;&macr;&Ecirc;&yacute;&ordm;ó&pound;&not;&sup2;&raquo;&Auml;&Uuml;&Oacute;&Atilde;memset °&Ntilde;&Euml;ü&frac12;&oslash;&ETH;&ETH;&Ouml;&Atilde;&Aacute;&atilde;&iexcl;&pound;
        ±&Egrave;&Egrave;&ccedil;±&frac34;&Igrave;&acirc;&Ouml;&ETH;°&Ntilde;&Ograve;&raquo;&cedil;&ouml;&frac12;&ETH;mul2&micro;&Auml;&Ecirc;&yacute;×é&acute;&laquo;&cedil;&oslash;&Ograve;&raquo;&cedil;&ouml;int *to &micro;&Auml;&Ouml;&cedil;&Otilde;&euml;&pound;&not;
        &Egrave;&raquo;&ordm;ó&Ocirc;&Uacute;&ordm;&macr;&Ecirc;&yacute;&Ouml;&ETH;&Ecirc;&sup1;&Oacute;&Atilde;memset(to,0,sizeof(to))&sup3;&otilde;&Ecirc;&sup1;&raquo;&macr;&Ecirc;§°&Uuml;&iexcl;&pound;
        &Ograve;ò&Icirc;&ordf;&acute;&Euml;&Ecirc;±sizeof(to)&micro;&Auml;·&micro;&raquo;&Oslash;&Ouml;&micro;&sup2;&cent;&sup2;&raquo;&Ecirc;&Ccedil;&Otilde;&ucirc;&cedil;&ouml;&Ecirc;&yacute;×é&micro;&Auml;&acute;ó&ETH;&iexcl;&pound;&not;&para;&oslash;
        &frac12;&ouml;&Ecirc;&Ccedil;&Otilde;&acirc;&cedil;&ouml;&Ouml;&cedil;&Otilde;&euml;&micro;&Auml;&acute;ó&ETH;&iexcl;&iexcl;&pound; 
*/

